2 . 1 Why is ATPG easy ?
نویسندگان
چکیده
Empirical observation shows that practically encountered instances of ATP6 are efficiently solvable. However, it has been known for more than two decades that ATPG is an NP-complete problem. This work is one of the first attempts to reconcile these seemingly disparate results. We introduce the concept of circuit cut-width and characterize the complexity of ATPG in terms of this property. We provide theoretical and empirical results to argue that an interestingly large class of practical circuits have cut-width characteristics which ensure a provably efficient solution of ATPG on them.
منابع مشابه
High Time For High Level ATPG
High level ATPG does not make the test problem any easy. In fact, there are several design-flow-related complications it creates. Also, the fault models used in high level ATPG are not suitable. Gate level ATPG has dominated for over 20 years and continue to do so. And there are enough challenging unsolved problems in gate level ATPG and there is no evidence that high level ATPG provides any he...
متن کاملSatis ability for ATPG : Is it easy ?
It has been observed that SAT formulae derived from ATPG problems are eeciently solvable in practise. This seems counter-intuitive since SAT is known to be NP ? Complete. This work seeks to explain this paradox. We identify a certain property of circuits which facilitates eecient solution of ATPG-SAT instances arising from them. In addition, we provide both theoretical proofs and empirical evid...
متن کاملATPG Using Fast Justification and Propagation on the Implication Graph
Automatic Test Pattern Generation (ATPG) primarily has to solve three fundamental Boolean problems: justification, propagation, and implication. In the past, various data structures (e.g. netlists, CNFs, decision diagrams) have been used to tackle these problems with none of them being specifically optimized for all these tasks. That is why we propose fast and optimized algorithms for justifica...
متن کاملHigh Fault Coverage ATPG for Industrial Application using DYNAMIC SAT Technique
It is a novel technique for automatic test pattern generation which well detects both easy to detect faults and hard to detect faults. ATPG based on this SAT technique dynamic clause activation (DCA) generates a limited number of test patterns which can cover more faults. ATPG based on implication graph have problems to cope with hard-todetect faults. ATPG based on Boolean satisfiability does n...
متن کاملHigh-level ATPG for Early Power Analysis
Wolfgang Roethig NEC Electronics 2880 Scott Blvd., Santa Clara CA 95052 [email protected] This paper proposes to put power analysis into the scope of high-level ATPG. The similarities between ATPG and simulation vector generation for power analysis have been identified in the past. In both cases, a sequence of simulation vectors is to be generated with maximum toggle count on all relevant net...
متن کامل